/*************************************************************************
	> File Name: P2626.cpp
	> Author: yufangze
	> Mail: 2224590123@qq.com
	> Created Time: 2025-01-10 10:27:37
 ************************************************************************/

#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

#define MAX_N 50
long long f[MAX_N + 5];

const long long mod = pow(2, 31);

int main() {
    int n;
    cin >> n;
    f[1] = 1, f[2] = 1;
    for (int i = 3; i <= n; i++) {
        f[i] = (f[i - 1] + f[i - 2]) % mod;
    }
    long long val = f[n];
    int i = 2, flag = 0;
    cout << val << "=";
    while (i * i <= val) {
        while (val % i == 0) {
            if (flag != 0) cout << "*";
            cout << i;
            val /= i;
            flag++;
        }
        i++;
    }
    if (val != 1) {
        if (flag) cout << "*";
        cout << val;
    }
    cout << endl;
    return 0;
}
